CONSTRAINED AND REGULARIZED SYSTEMIDENTIFICATIONTor

نویسنده

  • Tor A. Johansen
چکیده

Prior knowledge can be introduced into system identiication problems in terms of constraints on the parameter space, or regularizing penalty functions in a prediction error criterion. The contribution of this work is mainly an extention of the well known FPE (Final Prediction Error) statistic to the case when the system identiication problem is constrainted and contains a regularization penalty. The FPECR statistic (Final Prediction Error with Constraints and Regularization) is of potential interest as a criterion for selection of both regularization parameters and structural parameters such as order.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hamburger Beiträge zur Angewandten Mathematik Variational Discretization of Lavrentiev - Regularized State Constrained Elliptic Control Problems

In the present work, we apply a variational discretization proposed by the first author in [14] to Lavrentiev-regularized state constrained elliptic control problems. We extend the results of [18] and prove weak convergence of the adjoint states and multipliers of the regularized problems to their counterparts of the original problem. Further, we prove error estimates for finite element discret...

متن کامل

Relationship between the optimal solutions of least squares regularized with L0 -norm and constrained by k-sparsity

Two widely used models to find a sparse solution from a noisy underdetermined linear system are the constrained problem where the quadratic error is minimized subject to a sparsity constraint, and the regularized problem where a regularization parameter balances the minimization of both quadratic error and sparsity. However, the connections between these two problems have remained unclear so fa...

متن کامل

Solving the L1 regularized least square problem via a box-constrained smooth minimization

In this paper, an equivalent smooth minimization for the L1 regularized least square problem is proposed. The proposed problem is a convex box-constrained smooth minimization which allows applying fast optimization methods to find its solution. Further, it is investigated that the property ”the dual of dual is primal” holds for the L1 regularized least square problem. A solver for the smooth pr...

متن کامل

Multigrid Solution of a Lavrentiev-Regularized State-Constrained Parabolic Control Problem

A mesh-independent, robust, and accurate multigrid scheme to solve a linear state-constrained parabolic optimal control problem is presented. We first consider a Lavrentiev regularization of the state-constrained optimization problem. Then, a multigrid scheme is designed for the numerical solution of the regularized optimality system. Central to this scheme is the construction of an iterative p...

متن کامل

Linearized Alternating Direction Method of Multipliers for Constrained Nonconvex Regularized Optimization

In this paper, we consider a wide class of constrained nonconvex regularized minimization problems, where the constraints are linearly constraints. It was reported in the literature that nonconvex regularization usually yields a solution with more desirable sparse structural properties beyond convex ones. However, it is not easy to obtain the proximal mapping associated with nonconvex regulariz...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997